On growth rates of hereditary permutation classes

نویسنده

  • Martin Klazar
چکیده

A class of permutations is called hereditary if implies where the relation is the natural containment of permutations Let n be the set of all permutations of n belonging to We investigate the counting functions n j nj of hereditary classes Our main result says that if j nj n for at least one n then there is a unique k such that Fn k j nj Fn k n c holds for all n with a constant c Here Fn k are the generalized Fibonacci numbers which grow like powers of the largest positive root of xk xk We characterize also the constant and the polynomial growth of hereditary permutation classes and give two more results on these

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small Permutation Classes

We establish a phase transition for permutation classes (downsets of permutations under the permutation containment order): there is an algebraic number κ, approximately 2.20557, for which there are only countablymany permutation classes of growth rate (StanleyWilf limit) less than κ but uncountably many permutation classes of growth rate κ, answering a question of Klazar. We go on to completel...

متن کامل

Growth Rates of Geometric Grid Classes of Permutations

Geometric grid classes of permutations have proven to be key in investigations of classical permutation pattern classes. By considering the representation of gridded permutations as words in a trace monoid, we prove that every geometric grid class has a growth rate which is given by the square of the largest root of the matching polynomial of a related graph. As a consequence, we characterise t...

متن کامل

Intervals of Permutation Class Growth Rates

We prove that the set of growth rates of permutation classes includes an infinite sequence of intervals whose infimum is θB ≈ 2.35526, and that it also contains every value at least λB ≈ 2.35698. These results improve on a theorem of Vatter, who determined that there are permutation classes of every growth rate at least λA ≈ 2.48187. Thus, we also refute his conjecture that the set of growth ra...

متن کامل

On permutation pattern classes with two restrictions only

Permutation pattern classes that are defined by avoiding two permutations only and which contain only finitely many simple permutations are characterized and their growth rates are determined.

متن کامل

Juxtaposing Catalan Permutation Classes with Monotone Ones

This talk describes a clean and unified way to enumerate all juxtaposition classes of the form “Av(abc) next to Av(xy)”, where abc is a permutation of length three and xy is a permutation of length two. The main tools are Dyck paths, decorated by sequences of points, and context free grammars, used afterwards to enumerate these decorated Dyck paths. Juxtapositions are a simple special case of p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002